x1, y1, x2, y2, x3, y3 = [int(i) for i in input().split()]
a1 = (x2 - x1, y2 - y1)
a2 = (x3 - x2, y3 - y2)
vecprod = a1[0] * a2[1] - a1[1] * a2[0]
if vecprod != 0 and (x2 - x1)**2 + (y2 - y1)**2 == (x3 - x2)**2 + (y3 - y2)**2:
print("YES")
else:
print("NO")
//
// Created by Administrator on 2023/5/17.
//
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int main() {
long double ax,ay,bx,by,cx,cy;
cin>>ax>>ay>>bx>>by>>cx>>cy;
if((by-ay)/(bx-ax)!=(cy-by)/(cx-bx)&&(by-ay)*(by-ay)+(bx-ax)*(bx-ax)==(cy-by)*(cy-by)+(cx-bx)*(cx-bx)) {
printf("Yes\n");
} else {
printf("No\n");
}
//
return 0;
}
1732. Find the Highest Altitude | 709. To Lower Case |
1688. Count of Matches in Tournament | 1684. Count the Number of Consistent Strings |
1588. Sum of All Odd Length Subarrays | 1662. Check If Two String Arrays are Equivalent |
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |
672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |